-
1 linked cluster algorithm
abbr. LCAалгоритм связанных Абонентских) групп (применяется в ПРС для разбиения всей совокупности УПР на связанные группы, т.е. для построения архитектуры связанных групп); см. cluster 1Англо-русский словарь промышленной и научной лексики > linked cluster algorithm
-
2 cluster
кластер, скопление ( нестабильная коррелированная группа частиц)несколько, два или более, объектов водоотведения (напр., два завода, сбрасывающих сточные воды)гнездо ( терминалов)кластер, агломерация, группа населённых мест1. ( абонентская) группа, кластер (группа абонентов в ПРС, которые могут вступать между собой в связь непосредственно, а с другими абонентами ПРС - через центральный [главный] узел и переходные узлы [шлюзы] группы);2. группа отсчётов в выборке, кластер; см. также clusterhead; cluster link; cluster linkage; disjoint clusters; gateway; intercluster routing; intracluster routing; linked cluster algorithm; linked cluster architecture; overlapping clusters; primary cluster; secondary cluster; superclusterнесколько ( два или более) объектов водоотведения или забора воды (напр., два завода, сбрасывающих сточные воды в один водный объект)Англо-русский словарь промышленной и научной лексики > cluster
-
3 алгоритм связанных групп
Computers: linked cluster algorithmУниверсальный русско-английский словарь > алгоритм связанных групп
См. также в других словарях:
Cluster headache — Classification and external resources The Cluster Headache by JD Fletcher ICD 10 G44 … Wikipedia
Computer cluster — Not to be confused with data cluster. A computer cluster is a group of linked computers, working together closely thus in many respects forming a single computer. The components of a cluster are commonly, but not always, connected to each other… … Wikipedia
List of ad hoc routing protocols — An ad hoc routing protocol is a convention, or standard, that controls how nodes decide which way to route packets between computing devices in a mobile ad hoc network . In ad hoc networks, nodes are not familiar with the topology of their… … Wikipedia
Feynman diagram — The Wick s expansion of the integrand gives (among others) the following termNarpsi(x)gamma^mupsi(x)arpsi(x )gamma^ upsi(x )underline{A mu(x)A u(x )};,whereunderline{A mu(x)A u(x )}=int{d^4pover(2pi)^4}{ig {mu u}over k^2+i0}e^{ k(x x )}is the… … Wikipedia
List of ad-hoc routing protocols — An Ad hoc routing protocol is a convention or standard that controls how nodes come to agree which way to route packets between computing devices in a mobile ad hoc network (MANET).In ad hoc networks , nodes do not have a priori knowledge of… … Wikipedia
Mathematics and Physical Sciences — ▪ 2003 Introduction Mathematics Mathematics in 2002 was marked by two discoveries in number theory. The first may have practical implications; the second satisfied a 150 year old curiosity. Computer scientist Manindra Agrawal of the… … Universalium
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
CHAOS (Linux distribution) — infobox OS name = CHAOS caption = CHAOS 1.6 Boot Welcome Screen developer = Midnight Code / Ian Latter family = Linux source model = Open source latest release version = 1.6 latest release date = April 2005] working state = Currentcite web |… … Wikipedia
Automatic summarization — is the creation of a shortened version of a text by a computer program. The product of this procedure still contains the most important points of the original text. The phenomenon of information overload has meant that access to coherent and… … Wikipedia
evolution — evolutional, adj. evolutionally, adv. /ev euh looh sheuhn/ or, esp. Brit., /ee veuh /, n. 1. any process of formation or growth; development: the evolution of a language; the evolution of the airplane. 2. a product of such development; something… … Universalium
Data Intensive Computing — is a class of parallel computing applications which use a data parallel approach to processing large volumes of data typically terabytes or petabytes in size and typically referred to as Big Data. Computing applications which devote most of their … Wikipedia